Efficient Numerical Algorithm on Irreducible Multiparty Correlations
نویسندگان
چکیده
منابع مشابه
Irreducible multiparty correlations in quantum states without maximal rank.
The correlations of an n-partite quantum state are classified into a series of irreducible k-party ones (2<or=k<or=n), with the irreducible k-party correlation being the correlation in the states of k parties but nonexistent in the states of (k-1) parties. A measure of the degree of irreducible k-party correlation is defined based on the principle of maximal entropy. Adopting a continuity appro...
متن کاملIrreducible Numerical Semigroups
We give a characterization for irreducible numerical semi-groups. From this characterization we obtain that every irre-ducible numerical semigroup is either a symmetric or pseudo-symmetric numerical semigroup. We study the minimal presentations of an irreducible numerical semigroup. Separately, we deal with the cases of maximal embedding dimension and multiplicity 3 and 4.
متن کاملNumerical Local Irreducible Decomposition
Globally, the solution set of a system of polynomial equations with complex coefficients can be decomposed into irreducible components. Using numerical algebraic geometry, each irreducible component is represented using a witness set thereby yielding a numerical irreducible decomposition of the solution set. Locally, the irreducible decomposition can be refined to produce a local irreducible de...
متن کاملGeneralizing Efficient Multiparty Computation
We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell et al. and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Tr...
متن کاملNumerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capability as a blackbox device to solve systems which have positive dimensional components of solutions. We indicate how the software package PHCpack can be used in conjunction with Maple and programs written in C. We desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Theoretical Physics
سال: 2014
ISSN: 0253-6102
DOI: 10.1088/0253-6102/61/2/07